SIMPLE algorithm

Results: 168



#Item
101Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity [Cryptology ePrint Archive, ReportBenoˆıt Chevallier-Mames1 , Mathieu Ciet2 , and Marc Joye1 1

Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity [Cryptology ePrint Archive, ReportBenoˆıt Chevallier-Mames1 , Mathieu Ciet2 , and Marc Joye1 1

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2003-11-12 11:22:51
102A Simple Entropy-Based Algorithm for Planar Point Location∗ Sunil Arya† Theocharis Malamatos‡  David M. Mount§

A Simple Entropy-Based Algorithm for Planar Point Location∗ Sunil Arya† Theocharis Malamatos‡ David M. Mount§

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2007-02-02 02:49:19
103Latent Class Analysis Jeroen K. Vermunt & Jay Magidson The basic idea underlying latent class (LC) analysis is a very simple one: some of the parameters of a postulated statistical model differ across unobserved subgroup

Latent Class Analysis Jeroen K. Vermunt & Jay Magidson The basic idea underlying latent class (LC) analysis is a very simple one: some of the parameters of a postulated statistical model differ across unobserved subgroup

Add to Reading List

Source URL: statisticalinnovations.com

Language: English - Date: 2006-09-05 12:11:48
104Generalised Eigenspaces and the block upper triangular form In pp. 300–304 of his book Linear Algebra, M. O’Nan gives a simple algorithm for finding a block upper triangular form similar to a given matrix whose chara

Generalised Eigenspaces and the block upper triangular form In pp. 300–304 of his book Linear Algebra, M. O’Nan gives a simple algorithm for finding a block upper triangular form similar to a given matrix whose chara

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2002-01-31 03:15:38
105Simple Rules for Low-Knowledge Algorithm Selection? J. Christopher Beck and Eugene C. Freuder Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland {c.beck,e.freuder}@

Simple Rules for Low-Knowledge Algorithm Selection? J. Christopher Beck and Eugene C. Freuder Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland {c.beck,e.freuder}@

Add to Reading List

Source URL: tidel.mie.utoronto.ca

Language: English - Date: 2006-01-18 12:07:28
106Weighted Random Sampling over Data Streams  arXiv:1012.0256v1 [cs.DS] 1 Dec 2010 Pavlos S. Efraimidis Department of Electrical and Computer Engineering,

Weighted Random Sampling over Data Streams arXiv:1012.0256v1 [cs.DS] 1 Dec 2010 Pavlos S. Efraimidis Department of Electrical and Computer Engineering,

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2010-12-01 20:14:46
107What algorithms are supported in Figaro? Current built-in algorithms include:  Exact inference using variable elimination

What algorithms are supported in Figaro? Current built-in algorithms include:  Exact inference using variable elimination

Add to Reading List

Source URL: www.cra.com

Language: English - Date: 2014-11-17 13:08:42
108Homework Five, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious.

Homework Five, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious.

Add to Reading List

Source URL: cseweb.ucsd.edu

- Date: 2014-11-01 14:36:32
    109Verifiable Encryption of Digital Signatures and Applications GIUSEPPE ATENIESE The Johns Hopkins University  This paper presents a new simple schemes for verifiable encryption of digital signatures. We make

    Verifiable Encryption of Digital Signatures and Applications GIUSEPPE ATENIESE The Johns Hopkins University This paper presents a new simple schemes for verifiable encryption of digital signatures. We make

    Add to Reading List

    Source URL: www.cs.jhu.edu

    Language: English - Date: 2004-05-21 14:56:23
    110Near Optimal Tree Size Bounds on a Simple Real Root Isolation Algorithm Vikram Sharma Institute of Mathematical Sciences Chennai, India[removed]

    Near Optimal Tree Size Bounds on a Simple Real Root Isolation Algorithm Vikram Sharma Institute of Mathematical Sciences Chennai, India[removed]

    Add to Reading List

    Source URL: www.cs.nyu.edu

    Language: English - Date: 2012-03-23 13:26:04